Reduction Techniques for Finite (Tree) Automata

Till Mosa och Elias som gör livet så mycket roligare att leva. " Notice that the stiffest tree is most easily cracked, while the bamboo or willow survives by bending with the wind. " – Bruce Lee List of Papers This thesis is based on the following publications, which are referred to in the text by their Roman numerals. The thesis contains extended versions of all the papers. I. I developed the algorithm together with Marcus Nilsson. I implemented the algorithm (both the symbolic and the non-symbolic versions) in the framework of Regular Modelchecking and did all the experiments with other tools (CWB-NC and CWB). I participated in all parts of the work. II. With Johanna Högberg I developed the idea of bisimulation for tree au-tomata. I implemented the algorithm and participated in all parts of the work. III. I participated in the discussions and I implemented the algorithm. I wrote the experimental section. IV. I implemented the algorithm and with support from my supervisor, did most of the writing. V. I implemented the algorithm, conducted all experiments, and participated in the discussions and writing.